A Sublinear Time Algorithm for PageRank Computations
نویسندگان
چکیده
In a network, identifying all vertices whose PageRank is more than a given threshold value ∆ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When given a directed network G = (V,E), a threshold value ∆, and a positive constant c > 3, with probability 1 − o(1), our algorithm will return a subset S ⊆ V with the property that S contains all vertices of PageRank at least ∆ and no vertex with PageRank less than ∆/c. The running time of our algorithm is always Õ( n ∆ ). In addition, our algorithm can be efficiently implemented in various network access models including the Jump and Crawl query model recently studied by [6], making it suitable for dealing with large social and information networks. As part of our analysis, we show that any algorithm for solving this problem must have expected time complexity of Ω( n ∆ ). Thus, our algorithm is optimal up to logarithmic factors. Our algorithm (for identifying vertices with significant PageRank) applies a multi-scale sampling scheme that uses a fast personalized PageRank estimator as its main subroutine. For that, we develop a new local randomized algorithm for approximating personalized PageRank which is more robust than the earlier ones developed by Jeh and Widom [9] and by Andersen, Chung, and Lang [2].
منابع مشابه
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
A fundamental problem arising in many applications in Web science and social network analysis is the problem of identifying all nodes in a network whose PageRank exceeds a given threshold ∆. In this paper, we study the probabilistic version of the problem where given an arbitrary approximation factor c > 1, we are asked to output a set S of nodes such that with high probability, S contains all ...
متن کاملComputing Heat Kernel Pagerank and a Local Clustering Algorithm
Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time O( log( ) logn 3 log log( 1) ), assuming performing a random walk step and sampling from a distribution with b...
متن کاملDistributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank
A distributed algorithm performs local computations on pieces of input and communicates the results through given communication links. When processing a massive graph in a distributed algorithm, local outputs must be configured as a solution to a graph problem without shared memory and with few rounds of communication. In this paper we consider the problem of computing a local cluster in a mass...
متن کاملFinding Consensus in Multi-Agent Networks Using Heat Kernel Pagerank
We present a new and efficient algorithm for determining a consensus value for a network of agents. Different from existing algorithms, our algorithm evaluates the consensus value for very large networks using heat kernel pagerank. We consider two frameworks for the consensus problem, a weighted average consensus among all agents, and consensus in a leader-following formation. Using a heat kern...
متن کاملBidirectional PageRank Estimation: From Average-Case to Worst-Case
We present a new algorithm for estimating the Personalized PageRank (PPR) between a source and target node on undirected graphs, with sublinear running-time guarantees over the worst-case choice of source and target nodes. Our work builds on a recent line of work on bidirectional estimators for PPR, which obtained sublinear running-time guarantees but in an average-case sense, for a uniformly r...
متن کامل